A simple planning problem for COVID-19 lockdown: a dynamic programming approach.

A large number of recent studies consider a compartmental SIR model to study optimal control policies aimed at containing the diffusion of COVID-19 while minimizing the economic costs of preventive measures. Such problems are non-convex and standard results need not to hold. We use a Dynamic Programming approach and prove some continuity properties of the value function of the associated optimization problem. We study the corresponding Hamilton-Jacobi-Bellman equation and show that the value function solves it in the viscosity sense. Finally, we discuss some optimality conditions. Our paper represents a first contribution towards a complete analysis of non-convex dynamic optimization problems, within a Dynamic Programming approach.

Verification results for age-structured models of economic-epidemics dynamics.

In this paper we propose a macro-dynamic age-structured set-up for the analysis of epidemics/economic dynamics in continuous time. The resulting optimal control problem is reformulated in an infinite dimensional Hilbert space framework where we perform the basic steps of dynamic programming approach. Our main result is a verification theorem which allows to guess the feedback form of optimal strategies. This will be a departure point to discuss the behavior of the models of the family we introduce and their policy implications.